منابع مشابه
Aplicação do Problema da Gramática Mínima ao Projeto do Aspecto Sintático de Linguagens de Programação
This paper introduces a proposal of method for grammar inference of programming languages based in source-code examples. The strategy proposed in this method uses the solution of the smallest grammar problem for conversion of text representation into grammars that form the base of an adaptive model, which generalizes the respective resulting grammars from positive and negative examples. Resumo....
متن کاملEpilepsy, Grand Mal, Petit Mal Convulsions
traneous" hormones, (e) metabolic studies, (f) sensitivity of presumed target organ, (g) effects of removal of certain of the endocrines, (h) effect of hypophysectomy on target organs (related to subject "g"), and (i) graft studies. No student of experimental embryology should be denied the opportunity of reading Jost's essay. Finally, the essay by Greep on the interrelations of pituitary funct...
متن کاملAlgoritmos para o problema do subgrafo acíclico máximo sob restrições disjuntivas
In this work we tackle the Maximum Acyclic Subgraph problem under Negative Disjunctive Constraints (MASNDC) and the Maximum Acyclic Subgraph problem under Positive Disjunctive Constraints (MASPDC), both belonging to the NP Hard class. Disjunctive constraints can be negative, in which a certain pair of entities cannot be contained simultaneously in a feasible solution; or positive in that, given...
متن کاملMinimização do Impacto do Problema de Desvio de Conceito por Meio de Acoplamento em Ambiente de Aprendizado Sem Fim
Machine Learning (ML) is a research subarea of Artificial Intelligence that aims to develop computer programs that can evolve with new experiences. Among the many ML goals, the endless learning, i.e., methods that would enable computer systems to autonomously improve their own performance, based on previously learnt information, is of particular interest in the research described in this paper....
متن کاملO Problema do Subgrupo Oculto em uma Classe de Produto Semidireto de Grupos
We present an efficient quantum algorithm for the hidden subgroup problem (HSP) on the semidirect product of cyclic groups Zpr oφ Zps , where p is any odd prime number and r and s are any positives integers such that r ≥ 2s. This quantum algorithm is exponentially more efficient than any classical algorithm for the same purpose. Resumo. Neste trabalho, apresentamos um algoritmo quântico eficien...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Basilíade - Revista de Filosofia
سال: 2021
ISSN: 2596-092X
DOI: 10.35357/2596-092x.v3n5p209-228/2021